Inverse Entailment in Nonmonotonic Logic Programs
نویسنده
چکیده
Inverse entailment (IE) is known as a technique for finding inductive hypotheses in Horn theories. When a background theory is nonmonotonic, however, IE is not applicable in its present form. The purpose of this paper is extending the IE technique to nonmonotonic inductive logic programming (ILP). To this end, we first establish a new entailment theorem in normal logic programs, then introduce the notion of contrapositive programs. Finally, a theory of IE in nonmonotonic ILP is constructed.
منابع مشابه
A Tableau Calculus for Equilibrium Entailment
We apply tableau methods to the problem of computing entailment in the nonmonotonic system of equilibrium logic, a generalisation of the inference relation associated with the stable model and answer set semantics for logic programs. We describe tableau calculi for the nonclassical logics underyling equilibrium entailment, namely hereand-there with strong negation and its strengthening classica...
متن کاملAn Algebraic Approach to Belief Contraction and Nonmonotonic Entailment
The approach of Alchourrón, Gärdenfors and Makinson to belief contraction is treated algebraically. This is then used to give an algebraic treatment of nonmonotonic entailment in the context of a belief set. The algebra used is a preboolean algebra whose elements are sets of sentences and whose order relation is restricted entailment. Under plausible assumptions restricted entailment is computa...
متن کاملAlgebraic Belief Revision and Nonmonotonic Entailment: Results and Proofs
An algebraic approach to AGM belief revision and nonmonotonic entailment is defined. Results are stated and detailed proofs given. However this is not a survey article so the literature is not reviewed nor is there much reflective discussion. The algebra, PSEN, is a preboolean algebra whose elements are sets of sentences and whose order relation is restricted entailment. Restricted entailment i...
متن کاملData Repair of Inconsistent DL-Programs
Nonmonotonic Description Logic (DL) programs support rule-based reasoning on top of Description Logic ontologies, using a well-defined query interface. However, the interaction of the rules and the ontology may cause inconsistency such that no answer set (i.e. model) exists. We thus consider repairing DL-programs, i.e., changing formulas to obtain consistency. Viewing the data part of the ontol...
متن کاملA modal perspective on defeasible reasoning
We introduce various new supraclassical entailment relations for defeasible reasoning and investigate some of their relationships. The contrapositive of the usual nonmonotonic preferential entailment turns out to be a monotonic supraclassical entailment. Analogously to these two, a nonmonotonic and its contrapositive monotonic supraclassical entailment can be defined by using modal operators re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000